Mixing time of exponential random graphs
نویسندگان
چکیده
منابع مشابه
Mixing time of near-critical random graphs
Let C1 be the largest component of the Erdős–Rényi random graph G(n,p). The mixing time of random walk on C1 in the strictly supercritical regime, p = c/n with fixed c > 1, was shown to have order log n by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald. In the critical window, p = (1 + ε)/n where λ= εn is bounded, Nachmias and Peres proved that the mixing time on C1 is...
متن کاملDifferentially Private Exponential Random Graphs
We propose methods to release and analyze synthetic graphs in order to protect privacy of individual relationships captured by the social network. Proposed techniques aim at fitting and estimating a wide class of exponential random graph models (ERGMs) in a differentially private manner, and thus offer rigorous privacy guarantees. More specifically, we use the randomized response mechanism to r...
متن کاملUniform Mixing Time for Random Walk on Lamplighter Graphs
Suppose that G is a finite, connected graph and X is a lazy random walk on G. The lamplighter chain X associated with X is the random walk on the wreath product G = Z2 oG, the graph whose vertices consist of pairs (f, x) where f is a labeling of the vertices of G by elements of Z2 and x is a vertex in G. There is an edge between (f, x) and (g, y) in G if and only if x is adjacent to y in G and ...
متن کاملAsymptotic Quantization of Exponential Random Graphs
We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines. We show that as we continuously vary the slopes of these lines, a typical graph drawn from this model exhibits quantized behavior, jumping from one complete multipartite graph to another, and the jumps happen precisely at the normal lines of a polyhed...
متن کاملSpatial Mixing of Coloring Random Graphs
We study the strong spatial mixing (decay of correlation) property of proper q-colorings of random graphG(n, d/n) with a fixed d. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as G(n, d/n), an easy counterexample shows that colorings do not exh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2011
ISSN: 1050-5164
DOI: 10.1214/10-aap740